Local and Global Models for Large-Scale Peer-to-Peer Systems
نویسندگان
چکیده
منابع مشابه
Local and Global Models for Large-Scale Peer-to-Peer Systems
This article considers selected mathematical models on the spectrum between local (microscopic) and global (macroscopic) extreme views. The classification is oriented to the large-scale property, which may not be ignored in designs of P2P systems for the today’s and future Internet. A local model exploits the knowledge directly available at a given node, leading to easy implementation. A global...
متن کاملMacroscopic Properties of Large-Scale Peer-to-Peer Systems
Despite recent excitement generated by the peer-to-peer (P2P) paradigm and the surprisingly rapid deployment of some P2P applications, there are few quantitative evaluations of P2P systems behavior. The open architecture, achieved scale, and self-organizing structure of the Gnutella network make it an interesting P2P architecture to study. Like most other P2P applications, Gnutella builds, at t...
متن کاملdFault: Fault Localization in Large-Scale Peer-to-Peer Systems
Distributed hash tables (DHTs) have been adopted as a building block for large-scale distributed systems. The upshot of this success is that their robust operation is even more important as missioncritical applications begin to be layered on them. Even though DHTs can detect and heal around unresponsive hosts and disconnected links, several hidden faults and performance bottlenecks go undetecte...
متن کاملQueuing models for peer-to-peer systems
Recent development of peer-to-peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems not studied before. In these new systems, both job and server arrive and depart randomly. The server dynamics may or may not correlate to the job dynamics. Motivated by these observations, we develop queuing models for P2P service systems and a taxonomy fo...
متن کاملTwo Hop Lookups for Large Scale Peer-to-Peer Overlays
Most current peer-to-peer lookup algorithms keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. Lookups have high latency as each lookup requires contacting several nodes in sequence. In [2] we proposed a one hop lookup scheme, which scales up to systems of around ten million nodes. Lookups take only one hop most of the time, and this enables a l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal on Selected Topics in Nano Electronics and Computing
سال: 2013
ISSN: 2311-1801
DOI: 10.15393/j8.art.2013.2961